A Nonperturbative Eliasson’s Reducibility Theorem

نویسنده

  • Joaquim Puig
چکیده

This paper is concerned with discrete, one-dimensional Schrödinger operators with real analytic potentials and one Diophantine frequency. Using localization and duality we show that almost every point in the spectrum admits a quasi-periodic Bloch wave if the potential is smaller than a certain constant which does not depend on the precise Diophantine conditions. The associated first-order system, a quasiperiodic skew-product, is shown to be reducible for almost all values of the energy. This is a partial nonperturbative generalization of a reducibility theorem by Eliasson. We also extend nonperturbatively the genericity of Cantor spectrum for these Schrödinger operators. Finally we prove that in our setting, Cantor spectrum implies the existence of a Gδ-set of energies whose Schrödinger cocycle is not reducible to constant coefficients.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Almost Localization and Almost Reducibility

We develop a quantitative version of Aubry duality and use it to obtain several sharp estimates for the dynamics of Schrödinger cocycles associated to a non-perturbatively small analytic potential and Diophantine frequency. In particular, we establish the full version of Eliasson’s reducibility theory in this regime (our approach actually leads to improvements even in the perturbative regime: w...

متن کامل

Proving Properties of Typed λ-Terms Using Realizability, Covers, and Sheaves

The main purpose of this paper is to take apart the reducibility method in order to understand how its pieces fit together, and in particular, to recast the conditions on candidates of reducibility as sheaf conditions. There has been a feeling among experts on this subject that it should be possible to present the reducibility method using more semantic means, and that a deeper understanding wo...

متن کامل

A Reducibility that Corresponds to Unbalanced Leaf-Language Classes

We introduce the polynomial-time tree reducibility (ptt-reducibility). Our main result states that for languages B and C it holds that B ptt-reduces to C if and only if the unbalanced leaf-language class of B is robustly contained in the unbalanced leaf-language class of C. This is the unbalanced analogue of the well-known result by Bovet, Crescenzi, Silvestri, and Vereshchagin which connects p...

متن کامل

Measure Reducibility of Countable Borel Equivalence Relations

We show that every basis for the countable Borel equivalence relations strictly above E0 under measure reducibility is uncountable, thereby ruling out natural generalizations of the Glimm-Effros dichotomy. We also push many known results concerning the abstract structure of the measure reducibility hierarchy to its base, using arguments substantially simpler than those previously employed.

متن کامل

Effective Borel measurability and reducibility of functions

The investigation of computational properties of discontinuous functions is an important concern in computable analysis. One method to deal with this subject is to consider effective variants of Borel measurable functions. We introduce such a notion of Borel computability for single-valued as well as for multi-valued functions by a direct effectivization of the classical definition. On Baire sp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005